Uniformization and Anti-uniformization Properties of Ladder Systems

نویسندگان

  • ZOLTAN BALOGH
  • PAUL SZEPTYCKI
چکیده

Let S denote a stationary subset of limit ordinals of ω1. A ladder system on S is a sequence {Lα : α ∈ S} such that each Lα is an unbounded subset of α of order type ω. A ladder system is uniformizable if for each sequence 〈fα : α ∈ S〉 of functions fα : Lα → ω there is an F : ω1 → ω such that F Lα =∗ fα for each α ∈ S. I.e., for each α ∈ S, {β ∈ Lα : F (β) 6= fα(β)} is finite. We now formulate natural weakenings of uniformizable denoted, for each n ∈ ω, by Pn: A ladder system is said to satisfy Pn if for each f : S → ω there is an F : ω1 → [ω] such that for each α ∈ S (a) F Lα is eventually constant with value sα, and (b) f(α) ∈ sα. Note that P0 is equivalent to the version of uniformizable obtained by considering only sequences of constant functions fα. We will say that a ladder system satisfies P<ω if for each f : S → ω there is an F : ω1 → [ω] satisfying (a) and (b) above. If we drop the requirement that the restrictions F Lα are eventually constant we obtain uniformization properties that we denote Mn and M<ω. E.g., a ladder system is said to satisfy M<ω if for each f : S → ω there is an F : ω1 → [ω] such that for each α ∈ S, f(α) ∈ F (β) for all but finitely many β ∈ Lα. Most of these uniformization properties can be characterized in terms of properties of a certain topological space naturally associated to any ladder system. If L is a ladder system, let XL denote the topology space ω1 × {0} ∪ S × {1} where every point (α, 0) is isolated and for each α ∈ S, a basic neighborhood of (α, 1) consists of {(α, 1)} along with a cofinite subset of Lα×{0}. Such a space is always first countable and locally compact. The stationarity of S implies that it is not collectionwise Hausdorf. Spaces XL have been considered by many to construct examples of normal not collectionwise Hausdorff spaces (see [11] and [2]. It is folklore that a ladder system L satisfies P0 if and only if XL is normal. The property M<ω is characterized by XL being countably metacompact. For this reason, we will say that L is countably metacompact in the case that it satisfies M<ω.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniformization and the Diversity of Whitehead Groups

The connections between Whitehead groups and uniformization properties were investigated by the third author in [9]. In particular it was essentially shown there that there is a non-free Whitehead (respectively, א1-coseparable) group of cardinality א1 if and only if there is a ladder system on a stationary subset of ω1 which satisfies 2-uniformization (respectively, ω-uniformization). (See also...

متن کامل

Selection and Uniformization in Generalized Product

We investigate the selection and uniformization properties for classes of structures constructed by the FefermanVaught generalized product. We show that if classes K1 and K2 have the selection (respectively, uniformization) property, then the generalized product of these classes has the selection (respectively, uniformization) property.

متن کامل

Approximation of Polyhedral Surface Uniformization

We present a constructive approach for approximating the conformal map (uniformization) of a polyhedral surface to a canonical domain in the plane. The main tool is a characterization of convex spaces of quasiconformal simplicial maps and their approximation properties. As far as we are aware, this is the first algorithm proved to approximate the uniformization of general polyhedral surfaces.

متن کامل

Parallel Implementation of Uniformization to Compute the Transient Solution of Stochastic Automata Networks

Analysis of Stochastic Automata Networks (SAN) is a well established approach for modeling the behaviour of computing networks and systems, particularly parallel systems. The transient study of performance measures leads us to time and space complexity problems as well as error control of the numerical results. The SAN theory presents some advantages such as avoiding to build the entire infinit...

متن کامل

Numerical Solution of Non-Homogeneous Markov Processes through Uniformization

Numerical algorithms based on uniformization have been proven to be numerically stable and computationally at tractive to compute transient state distributions in ho mogeneous continuous time Markov chains Recently Van Dijk van Dijk formulated uniformization for non homogeneous Markov processes and it is of interest to investigate numerical algorithms based on uniformiza tion for non homogeneou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003